Synthesis of compromise sum-difference arrays through time-modulation
نویسندگان
چکیده
منابع مشابه
Synthesis of Compromise Sum-differencearrays through Time-modulation
In this paper, time-modulation is exploited for the synthesis of monopulse sub-arrayed antennas. The solution of the compromise sum-difference problem is obtained by setting the set of static excitations to an optimal sum set and synthesizing the “best compromise” difference pattern through a Continuous Partition Method (CPM ) based approach. The array elements are aggregated into sub-arrays co...
متن کاملDesign of Compromise Sum-difference Patterns through the Iterative Contiguous Partitionmethod
In this paper, an innovative approach for the synthesis of sub-arrayed monopulse linear arrays is presented. A compromise difference pattern is obtained through an optimal excitations matching method based on the contiguous partition technique integrated in an iterative procedure ensuring, at the same time, the optimization of the sidelobe level (or other beam pattern features). The flexibility...
متن کاملAnt Colony Based Hybrid Approach for Optimal Compromise Sum-difference Patterns Synthesis
Dealing with the synthesis of monopulse array antennas, many stochastic optimization algorithms have been used for the solution of the so-called optimal compromise problem between sum and difference patterns when sub-arrayed feed networks are considered. More recently, hybrid approaches, exploiting the convexity of the functional with respect to a sub-set of the unknowns (i.e., the sub-array ex...
متن کاملPattern Synthesis in Time-modulated Linear Arrays through Pulse Shifting
In this paper, an innovative approach for the synthesis of time-modulated linear array antennas is presented. The switch-on instants of the time-modulated elements are taken into account as additional degrees of freedom to optimize the array pattern. Towards this end, a technique based on a Particle Swarm Optimization is proposed to fully exploit the dependence of the sideband radiations on the...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Radar, Sonar & Navigation
سال: 2009
ISSN: 1751-8784
DOI: 10.1049/iet-rsn.2009.0058